A New Methodology on Rough Lattice Using Granular Concepts

Rough set theory has a vital role in the mathematical field of knowledge representation problems. Hence, algebraic structure is defined by Pawlak. Mathematics and Computer Science have many applications Lattice. The principle ordered been analyzed logic programming for crypto-protocols. Iwinski extended an approach towards lattice with rough whereas based on depends indiscernibility relation which was established Chakraborty. Granular means piecewise knowledge, grouping similar elements. universe partitioned to form Granular. This framed describe study its corresponding approximation space. Analysis reduction granular from information table object-oriented. An pair distributive lattices emphasize congruence class define projection. projection lemma defining that largest smallest elements are trivial sets index. A space examined incorporate upper analysis various possibilities. Cartesian product investigated. Lattice homomorphism equivalence conditions. Hence exists union intersection approximation. lower different subsets studied. generalized approximations were verify some results their properties.